#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;

int main(int argc, char const *argv[]){
    int loop;
    int buf_data[100];
    scanf("%d", &loop);
    for (int i = 0; i < loop; i++){
        int n, volume, max_con;
        scanf("%d %d %d", &n, &volume, &max_con);
        for (int j = 0; j < n; j++)
            scanf("%d", &buf_data[j]);

        sort(buf_data, buf_data+n);

        int max_volume = 0;
        double current_con = 0;
        for (int j = 0; j < n; j++){
            if(((double)(current_con*100 + buf_data[j])/(max_volume+volume)*100) > max_con)
                break;
            else{
            	max_volume += volume;
            	current_con = (current_con*100 + buf_data[j])/volume;
			}
        }
        printf("%d %.2lf\n", max_volume, current_con/max_volume*100);
    }
    return 0;
}
